Permutation Groups and Transformation Semi- Groups: Results and Problems
نویسندگان
چکیده
J.M. Howie, the influential St Andrews semigroupist, claimed that we value an area of pure mathematics to the extent that (a) it gives rise to arguments that are deep and elegant, and (b) it has interesting interconnections with other parts of pure mathematics. This paper surveys some recent results on the transformation semigroup generated by a permutation group G and a single non-permutation a. Our particular concern is the influence that properties of G (related to homogeneity, transitivity and primitivity) have on the structure of the semigroup. In the first part of the paper, we consider properties of S = 〈G, a〉 such as regularity and generation. The second is a brief report on the synchronization project, which aims to decide in what circumstances S contains an element of rank 1. The paper closes with a list of open problems on permutation groups and linear groups, and some comments about the impact on semigroups are provided. These two research directions outlined above lead to very interesting and challenging problems on primitive permutation groups whose solutions require combining results from several different areas of mathematics, certainly fulfilling both of Howie’s elegance and value tests in a new and fascinating way. 1 Regularity and generation
منابع مشابه
QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملGenerating Sets of the Kernel Graph and the Inverse Problem in Synchronization Theory
This paper analyses the construction of the kernel graph of a non-synchronizing transformation semigroup and introduces the inverse synchronization problem. Given a transformation semigroup S ≤ Tn, we construct the kernel graph Gr(S) by saying v and w are adjacent, if there is no f ∈ S with vf = wf . The kernel graph is trivial or complete if the semigroup is a synchronizing semigroup or a perm...
متن کاملUniversal Representations of Braid and Braid-permutation Groups
Drinfel’d used associators to construct families of universal representations of braid groups. We consider semi-associators (i.e., we drop the pentagonal axiom and impose a normalization in degree one). We show that the process may be reversed, to obtain semi-associators from universal representations of 3–braids. We view braid groups as subgroups of braid-permutation groups. We construct a fam...
متن کاملThe False Discovery Rate in Simultaneous Fisher and Adjusted Permutation Hypothesis Testing on Microarray Data
Background and Objectives: In recent years, new technologies have led to produce a large amount of data and in the field of biology, microarray technology has also dramatically developed. Meanwhile, the Fisher test is used to compare the control group with two or more experimental groups and also to detect the differentially expressed genes. In this study, the false discovery rate was investiga...
متن کاملPermutation groups and transformation semigroups
In collaboration with João Araújo and others, I have been thinking about relations between permutation groups and transformation semigroups. In particular, what properties of a permutation group G on a set Ω guarantee that, if f is any non-permutation on Ω (or perhaps any non-permutation of rank k), then the transformation semigroup 〈G, f〉 has specified properties. There is far too much to summ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013